A Library for Algorithmic Game Theory in Ssreflect/Coq
نویسندگان
چکیده
We report on the formalization in Ssreflect/Coq of a number of concepts and results from algorithmic game theory, including potential games, smooth games, solution concepts such as Pure and Mixed Nash Equilibria, Coarse Correlated Equilibria, -approximate equilibria, and behavioral models of games such as better-response dynamics. We apply the formalization to prove Price of Stability bounds for, and convergence under better-response dynamics of, the Atomic Routing game, which has applications in computer networking. Our second application proves that Affine Congestion games are (5/3, 1/3)-smooth, and therefore have Price of Anarchy 5/2. Our formalization is available online.
منابع مشابه
Proof Pattern Search in Coq/SSReflect
ML4PG is an extension of the Proof General interface of Coq, allowing the user to invoke machine-learning algorithms and find proof similarities in Coq/SSReflect libraries. In this talk, we will show the recent ML4PG features in action, using examples from the standard SSReflect library and HoTT library. We will compare ML4PG with traditional Coq searching tools and dependency graphs.
متن کاملEfficient Finite-Domain Function Library for the Coq Proof Assistant*
Finiteness is an important concept in the computer science. In particular, finite-domain functions are a useful concept for representing various data structures such as finite graphs, finite automata and matrices, and used in quite a few programs. We provide finite-domain function libraries in Coq [12], which improves the efficiency of code extracted from proofs without forcing one to rewrite t...
متن کاملFormalization of Shannon's Theorems in SSReflect-Coq
The most fundamental results of information theory are Shannon’s theorems. These theorems express the bounds for reliable data compression and transmission over a noisy channel. Their proofs are non-trivial but rarely detailed, even in the introductory literature. This lack of formal foundations makes it all the more unfortunate that crucial results in computer security rely solely on informati...
متن کاملPLMMS ’ 09 Proceedings of the ACM SIGSAM
The name Ssreflect stands for “small scale reflection”, a style of proof that evolved from the computer-checked proof of the Four Colour Theorem and which leverages the higherorder nature of Coq’s underlying logic to provide effective automation for many small, clerical proof steps. This is often accomplished by restating (“reflecting”) problems in a more concrete form, hence the name. While re...
متن کاملML4PG in Computer Algebra Verification
ML4PG is a machine-learning extension that provides statistical proof hints during the process of Coq/SSReflect proof development. In this paper, we use ML4PG to find proof patterns in the CoqEAL library – a library that was devised to verify the correctness of Computer Algebra algorithms. In particular, we use ML4PG to help us in the formalisation of an efficient algorithm to compute the inver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Formalized Reasoning
دوره 10 شماره
صفحات -
تاریخ انتشار 2017